Proving Primality in Essentially Quartic
نویسنده
چکیده
منابع مشابه
Proving primality in essentially quartic random time
This paper presents an algorithm that, given a prime n, finds and verifies a proof of the primality of n in random time (lg n)4+o(1). Several practical speedups are incorporated into the algorithm and discussed in detail.
متن کاملElliptic Curves, Primality Proving and Some Titanic Primes
We describe how to generate large primes using the primality proving algorithm of Atkin. Figure 1: The Titanic .
متن کاملDistributed Primality Proving and the Primality of (23539+1)/3
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certiication of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2 3539 +1)=3, the rst ordinary Titanic prime.
متن کاملFast Primality Proving on Cullen Numbers
We present a unconditional deterministic primality proving algorithm for Cullen numbers. The expected running time and the worst case running time of the algorithm are Õ(logN) bit operations and Õ(logN) bit operations, respectively.
متن کاملCyclotomy Primality Proving
Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heurist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003